A General Cryptanalysis of Permutation-Only Multimedia Encryption Algorithms
نویسندگان
چکیده
Secrete permutations are widely used in multimedia encryption algorithms, and many permutation-only ciphers have been proposed in recent years for protection of different types of multimedia data, especially digital images and videos. Based on a normalized encryption/decryption model, this paper analyzes the security of permutation-only image ciphers working in spatial domain from a general perspective, taking a recentlyproposed permutation-only image cipher called HCIE (hierarchical chaotic image encryption) as a typical example. It is pointed out that all permutation-only image ciphers are insecure against known/chosen-plaintext attacks in the sense that only O (logL(MN)) known/chosen plain-images are enough to break the ciphers, where MN is the size of the image and L is the number of different pixel values. Also, it is found that the attack complexity is only O(n · (MN)), where n is the number of known/chosen plain-images used. Following the results, it is found that hierarchical permutation-only image ciphers such as HCIE are less secure than normal (i.e., non-hierarchical) permutationonly image ciphers. Experiments are shown to verify the feasibility of the known/chosen-plaintext attacks. The cryptanalysis result is then generalized to permutation-only image ciphers working in frequency domain and video ciphers. In conclusion, secret permutations have to be combined with other encryption techniques to design highly secure multimedia encryption sysThis research was partially supported by the AIIS Inc., NY, USA, the Applied R&D Centers of the City University of Hong Kong (under grants no. 9410011 and no. 9620004), and the National Natural Science Foundation of China (under grant no. 60202002). Shujun Li and Guanrong Chen are with the Department of Electronic Engineering, City University of Hong Kong, Kowloon, Hong Kong, China. E-mails: [email protected], [email protected]. Chengqing Li is with the Department of Mathematics, Zhejiang University, Hangzhou, Zhejiang 310027, China. E-mail: [email protected]. Dan Zhang is with the College of Computer Science, Zhejiang University, Hangzhou, Zhejiang 310027, China. Nikolaos G. Bourbakis is with the Information Technology Research Institute, College of Engineering and Computer Science, Wright State University, 3640 Glenn Hwy, Dayton, OH 45435, USA. tems. This paper provides for the first time theoretically and experimentally clarification of such a security principle on the design of multimedia encryption algorithms.
منابع مشابه
Cipher text only attack on speech time scrambling systems using correction of audio spectrogram
Recently permutation multimedia ciphers were broken in a chosen-plaintext scenario. That attack models a very resourceful adversary which may not always be the case. To show insecurity of these ciphers, we present a cipher-text only attack on speech permutation ciphers. We show inherent redundancies of speech can pave the path for a successful cipher-text only attack. To that end, regularities ...
متن کاملA Performance Survey of Meta-Heuristic And Brute-Force Search Algorithms to Cryptanalysis The SDES Encryption Algorithm
For many years, cryptanalysis has been considered as an attractive topic in jeopardizing the security and resistance of an encryption algorithm. The SDES encryption algorithm is a symmetric cryptography algorithm that performs a cryptographic operation using a crypt key. In the world of encryption, there are many search algorithms to cryptanalysis. In these researches, brute force attack algori...
متن کاملArtemia: a family of provably secure authenticated encryption schemes
Authenticated encryption schemes establish both privacy and authenticity. This paper specifies a family of the dedicated authenticated encryption schemes, Artemia. It is an online nonce-based authenticated encryption scheme which supports the associated data. Artemia uses the permutation based mode, JHAE, that is provably secure in the ideal permutation model. The scheme does not require the in...
متن کاملSecurity of Sponge structures
Sponge structure is a structure widely used in the design of cryptographic algorithms that reduces the design of the algorithms to the design of a permutation or pseudo-random function. The development of sponge-based algorithms and the selection of designs based on this structure in SHA3 and CAESAR competitions increase the need to examine its security against various types of attacks. In the ...
متن کاملCryptanalysis of Video Encryption Algorithms
Content security is an important issue in multimedia applications. In this paper we perform a cryptanalysis of several encryption algorithms that have been proposed to protect the privacy of MPEG video streams. In particular, we analyze the encryption based on permuting the Huffman codeword list, and two selective encryption algorithms VEA and MVEA. For the convenience of the reader, we provide...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004